The MSE performance of constant modulus receivers

نویسندگان

  • Hanks H. Zeng
  • Lang Tong
چکیده

The constant modulus algorithm (CMA) is an e ective technique for blind receiver design in practice. Treating CMA as a linear estimation problem, e ects of noise and channel conditions are investigated. For the class of channels with arbitary nite impulse responses, an analytical description of locations of constant modulus receivers and an upper bound of their mean squared errors (MSE) are derived. We show that, with proper initializations, CMA can achieve almost the same performance as the (nonblind) minimum mean square error (MMSE) receiver. Our analysis reveals a strong relationship between the (blind) constant modulus and the (nonblind) MMSE receivers. It also highlights the signi cance of initialization/reinitialization schemes. The approach developed in this paper also applies to CMA blind beamforming in array signal processing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An analysis of constant modulus receivers

This paper investigates connections between (nonblind) Wiener receivers and blind receivers designed by minimizing the constant modulus (CM) cost. Applicable to both T-spaced and fractionally spaced FIR equalization, the main results include 1) a test for the existence of CM local minima near Wiener receivers; 2) an analytical description of CM receivers in the neighborhood of Wiener receivers;...

متن کامل

Relationships Between the Constant Modulus and Wiener Receivers

The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus (CM) cost function, the performance of CM receivers has primarily been evaluated using simulations. Theoretical analysis is typically based on either the noiseless case or approximations of the cost function. The followi...

متن کامل

An analysis of constant modulus algorithm for array signal processing

The constant modulus (CM) cost function is analyzed for array signal processing. The analysis includes arbitrary source types. It is shown that CM receivers have the signal space property except in two special cases. Local minima of CM cost function are completely characterized for the noiseless case. In the presence of measurement noise, the existence of CM local minima in the neighborhood of ...

متن کامل

Optimum delay and mean square error using CMA

The performance of the Constant Modulus Algorithm can su er because of the existence of local minimawith large Mean Squared Error(MSE). This paper presents a new way of obtaining the optimumMSE over all delays using a second equalizer under a mixed Constant Modulus and Cross Correlation Algorithm (CM-CCA). Proof of convergence is obtained for the noiseless case. Simulations demonstrate the pote...

متن کامل

Statistical performance analysis of the algebraic constant modulus algorithm

This paper presents a large sample analysis of the covariance of the beamformers computed by the analytical constant modulus algorithm (ACMA) method for blindly separating constant modulus sources. This can be used to predict the signal-to-interference plus noise ratio (SINR) performance of these beamformers, as well as their deviation from the (nonblind) Wiener receivers to which they asymptot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997